Non-disruptive transition to synchronous replication state

ABSTRACT

Techniques are provided for transitioning a first storage object and a second storage object from an asynchronous replication state to a synchronous replication state. Metadata operations are logged into a metadata log. Dirty data, modified by data operations executed upon the first storage object, are tracked using a dirty region log. Metadata operations are replicated from the metadata log to the second storage object during a metadata drain phase. During the metadata drain phase, incoming operations are logged into the metadata log when the metadata log has a non-zero size, otherwise, the metadata operations are replicated to the second storage object. After the metadata drain phase, a data drain phase is performed using the dirty region log.

BACKGROUND

Many storage systems may implement data replication and/or other redundancy data access techniques for data loss protection and non-disruptive client access. For example, a first computing device may be configured to provide clients with primary access to data stored within a first storage device and/or other storage devices. A second computing device may be configured as a backup for the first computing device in the event the first computing device fails. Data may be replicated from the first computing device to the second computing device. In this way, the second computing device can provide clients with access to replicated data in the event the first computing device fails.

One type of replication is asynchronous replication. When the first computing device receives an operation from a client device, the first computing device transmits a replication of the operation to the second computing device for execution. Irrespective of whether the second computing device has executed the replicated operation, the first computing device will transmit an acknowledgment of successful performance of the operation to the client device once the first computing device has executed the operation.

Another type of replication is synchronous replication, which provides a greater level of data protection guarantees. This is because the first computing device does not transmit the acknowledgment until the operation has been executed by the first computing device and the replication operation has been executed or acknowledged by the second computing device. In this way, two copies of data and/or metadata resulting from the operation are maintained before the client receives acknowledgment that the operation was successful.

Unfortunately, the first computing device and the second computing device can fall out of sync due to network transmission errors, computer failures, and/or other issues that will cause data maintained by the first computing device to diverge from replicated data maintained by the second computing device. Thus, the data protection guarantees provided by synchronous replication cannot be provided until storage of the first computing device and the second computing device are brought back into a synchronous replication state. Current resynchronization processes can be very disruptive to clients because client operations will be quiesced (e.g., client I/O operations will be blocked, failed, stopped, or queued for later execution) during various phases of resynchronization. Blocking client I/O can cause applications to time out, experience errors, increase client experienced latency, and disrupt access to data.

DESCRIPTION OF THE DRAWINGS

FIG. 1 is a component block diagram illustrating an example clustered network in which an embodiment of the invention may be implemented.

FIG. 2 is a component block diagram illustrating an example data storage system in which an embodiment of the invention may be implemented.

FIG. 3 is a flow chart illustrating an example method for performing a non-disruptive transition to a synchronous replication state.

FIG. 4A is a component block diagram illustrating an example system for performing a non-disruptive transition to a synchronous replication state, where data operations and metadata operations are logged.

FIG. 4B is a component block diagram illustrating an example system for performing a non-disruptive transition to a synchronous replication state, where a metadata drain phase is performed.

FIG. 4C is a component block diagram illustrating an example system for performing a non-disruptive transition to a synchronous replication state, where data drain phase is performed.

FIG. 5 is an example of a computer readable medium in which an embodiment of the invention may be implemented.

FIG. 6 is a component block diagram illustrating an example computing environment in which an embodiment of the invention may be implemented.

DETAILED DESCRIPTION

Some examples of the claimed subject matter are now described with reference to the drawings, where like reference numerals are generally used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide an understanding of the claimed subject matter. It may be evident, however, that the claimed subject matter may be practiced without these specific details. Nothing in this detailed description is admitted as prior art.

In asynchronous replication, incremental changes to a storage object, such as a volume, a file, a directory, a defined set of files or directories, a file system, or a storage virtual machine comprising a plurality of volumes stored across one or more nodes of a cluster, are replicated from the storage object to a replicated storage object. In synchronous replication, when an operation is received from a client device (e.g., a write operation targeting the storage object), the operation is split to create a replicated operation that is a replication of the operation. The operation is executed upon the storage object, such as by a first computing device managing the storage object. The replicated operation is executed upon the replicated storage object, such as by a second computing device managing the replicated storage object. The operation is not acknowledged to the client device as being complete until both the operation and the replicated operation have been successfully executed upon the storage object and the replicated storage object.

Synchronous replication can be implemented for a new volume in a relatively easy manner. This is because there are no pending client I/O, making real-time changes and modifications to the new volume, that need to be dealt with in order to make a replicated volume of the new volume consistent with the new volume. These pending I/O would otherwise need to be handled so that the new volume and the replicated volume have the same data as a baseline for starting to synchronously replicate new incoming client I/O.

However, for an existing volume that already comprises data that is being actively modified in real-time by incoming client I/O, a replicated volume will have to be brought into sync with respect to the existing volume so that the replicated volume has the same data as the existing volume. Because the existing volume is used to actively process client I/O, the replicated volume will lag behind the existing volume due to the client I/O modifying the existing volume. Thus, conventional techniques for transitioning from asynchronous replication to synchronous replication must pause client I/O (e.g., stop, block, fail, or queue the client I/O for later execution), which increases latency (e.g., increased latency while the client I/O is queued). This also affects the operation of client devices accessing data within the existing volume (e.g., an application may timeout or experience errors when data access operations, attempting to access data, are blocked or failed).

Accordingly, methods and/or systems are provided herein that can transition a storage object from an asynchronous replication state or other non-synchronous state (e.g., an out of sync state) to a synchronous replication state in a manner that mitigates client disruption and latency. That is, the transition (resynchronization) can be performed without holding client I/O (e.g., without pausing, blocking, failing, or queueing for later execution), which reduces client latency that would otherwise be experienced if the client I/O was held during the transition.

A dirty region log is used to track regions within the storage object that are modified by data operations, such as write operations executed during a last asynchronous incremental transfer (e.g., asynchronous incremental transfers may be initially performed to incrementally transfer data from the storage object to a replicated storage object to help make the replicated storage object comprise more of the same data as the storage object). The dirty region log may comprise bits that can be set to either a dirty indicator or a clean indicator. A bit may be mapped to a region within the storage object. Thus, the bit can be set to the dirty indicator to indicate that a data operation has modified the region (e.g., the region now comprises data not yet replicated to the replicated storage object). The bit can be set to the clean indicator to indicate that the region is now clean (e.g., the region has not been modified with data not yet replicated to the replicated storage object, and thus the region comprises the same data as a corresponding region within the replicated storage object).

A metadata log is used to track metadata operations that modify the storage object, such as a create operation (e.g., a create file operation, a create LUN operation, etc.), a link operation, an unlink operation, a rename operation (e.g., a file rename operation, etc.), a set attribute operation (e.g., a set volume size operation, an assign permissions operation, etc.), etc. In particular, copies of metadata operations executed upon the storage object during the last asynchronous transfer are inserted into the metadata log.

The metadata operations within the metadata log are replicated to the replicated storage object according to an order that the metadata operations were executed upon the storage object in order to maintain consistency. In particular, the metadata operations are assigned sequence numbers based upon the order that the metadata operations were executed upon the storage object by the first computing system. The metadata operations are inserted into the metadata log with the sequence numbers. In an embodiment, the metadata operations are sorted within the metadata log based upon the sequence numbers or are inserted into the metadata log based upon the sequence numbers. After the metadata operations are replicated to the second computing device for execution upon the replicated storage object according to the sequence numbers, the dirty regions identified by the dirty region log are replicated from the storage object to the replicated storage object. That is, the data within the dirty regions (e.g., “dirty” data not yet replicated to the replicated storage object) is transmitted to the second computing device for storage into corresponding regions within the replicated storage object. The replication of the dirty region is triggered based upon completion of the replication of the metadata operations.

In an embodiment, dirty region logs are created as incore dirty region logs (e.g., maintained in memory) for each storage object of a consistency group, such as for each file of the consistency group. Also, incore splitter objects (e.g., functionality configured to intercept and replicate operations) are setup for each replication endpoint (e.g., the replicated storage object hosted by the second computing device) and are set to a dirty region logging state. This ensures that incoming client writes are intercepted by the splitter objects, and for each region that is modified by the incoming client writes, dirty bits are set in the dirty region log. Thus, regions that are dirty are captured incore from this point forward. During the cutover phase, the splitter objects are changed to a cut over split state. From this point forward, for every incoming client I/O, a corresponding dirty region log for a target storage object is evaluated. If a write operation targets a dirty region of a storage object, then the write is executed upon the storage object. If a write operation targets a non-dirty or partially dirty region, then data of the write operation is written to the storage object and is split/replicated to a replicated storage object. A cutover scanner may be executed to read the incore dirty region logs. For every dirty region identified, dirty data is replicated to the replicated storage object. During the replication, a lock can be obtained for the dirty region so that any writes to the dirty region are blocked. The lock is removed once the second computing device writes the replicated dirty data to the replicated storage object.

This present system improves resynchronization by providing a seamless transition from asynchronous replication (or other non-synchronous replication state) to synchronous replication while maintaining consistency of a replica storage object. The resynchronization is performed with minimal throughput degradation of client I/O to a primary storage object. In particular, resynchronization includes a metadata drain phase and a subsequent data drain phase. The present system provides a seamless and consistent transition from the metadata drain phase to the data drain phase.

In an embodiment of performing a resynchronization, a first node stores a first storage object and a second node stores a second storage object maintained as a replica of the first storage object. A current synchronization state between the first storage object and the second storage object may be an asynchronous replication relationship. The resynchronization is performed to transition from the asynchronous replication relationship to a synchronous replication relationship.

As part of the resynchronization, asynchronous incremental transfers of data from the first storage object to the second storage object are performed. The incremental transfers are performed to replicate delta data of the first storage object (e.g., modified data not yet replicated to the second storage object) to the second storage object in order to reduce a different in data between the first storage object and the second storage object.

During an asynchronous incremental transfer, such as a last asynchronous incremental transfer, metadata operations executed upon the first storage object are logged into a metadata log. Dirty data modified by data operations executed upon the first storage object is tracked using a dirty region log. In this way, metadata operation and data operations from client devices are still processed during the resynchronization as opposed to be queued or failed. After the asynchronous incremental transfers, a metadata drain phase is performed and then a data drain phase is performed after the metadata drain phase. Incoming operations are still processed during the metadata drain phase and the data drain phase in order to reduce client latency, improve client throughput, and minimize client disruption from accessing the first storage object.

After the asynchronous incremental transfers are complete, the metadata drain phase is performed to replicate the metadata operations from the metadata log to the second storage object. During the metadata drain phase, incoming metadata operations and/or data operations are processed based upon various criteria (e.g., a state or size of the metadata log). In an embodiment, incoming metadata operations received during the metadata drain phase are logged into the metadata log based upon the metadata log having a size greater than zero. That is, the incoming metadata operation is executed upon the first storage object and is logged into the metadata log for subsequent replication based upon the metadata log comprising at least one metadata operation.

In an embodiment, incoming metadata operations are executed upon the first storage object and are replicated to the second storage object based upon the metadata log having a zero size (e.g., all metadata operations have been dequeued and processed from the metadata log). These incoming metadata operations are serialized with metadata operations replicated from the metadata log using a volume barrier. The volume barrier is used to make the metadata operations and the incoming data and metadata operations mutually exclusive when acquiring the volume barrier.

In an embodiment, incoming metadata operations are executed upon the first storage object and are replicated to the second storage object based upon a state of the resynchronization indicating a transition from the metadata drain phase to a data drain phase where the dirty data is replicated to the second storage object.

When a size of the metadata log is 1, then a last metadata operation is replicated from the metadata log to the second storage object using the volume barrier. The volume barrier is used to serialize replication of the last metadata operation with any incoming operations (e.g., incoming data and metadata operations) to provide data consistency.

In an embodiment, metadata operations are logged into the metadata log and dirty data is tracked within the dirty region log during the metadata drain phase. Metadata operations are replicated form the metadata log to the second storage object without using the volume barrier when the metadata log has a size greater than 1 (e.g., more than 1 metadata operation still needs to be processed/replicated from the metadata log).

Once the metadata drain phase has completed, the data drain phase is triggered. The data drain phase is triggered based upon the metadata log having a zero size. During the data drain phase, dirty data is replicated from the first storage object, as indicated by the dirty region log, to the second storage object. That is, the dirty region log specifies what regions of the first storage object comprise the dirty data (e.g., modified data not yet replicated to the second storage object). Thus, the dirty data is identified using the dirty region log, and is replicated from the first storage object to the second storage object. During the data drain phase, incoming metadata operations are executed upon the first storage object and are replicated to the second storage object. Replication of the dirty data by the data drain phase and replication of the incoming metadata operations is serialized using the volume barrier.

Upon completion of the metadata drain phase and the data drain phase, the first storage object and the second storage object are transitioned from the asynchronous replication relationship to a synchronous replication relationship. In this way, incoming operations targeting the first storage object are replicated to the second storage object in a synchronous manner.

To provide for performing a non-disruptive transition to a synchronous replication state, FIG. 1 illustrates an embodiment of a clustered network environment 100 or a network storage environment. It may be appreciated, however, that the techniques, etc. described herein may be implemented within the clustered network environment 100, a non-cluster network environment, and/or a variety of other computing environments, such as a desktop computing environment. That is, the instant disclosure, including the scope of the appended claims, is not meant to be limited to the examples provided herein. It will be appreciated that where the same or similar components, elements, features, items, modules, etc. are illustrated in later figures but were previously discussed with regard to prior figures, that a similar (e.g., redundant) discussion of the same may be omitted when describing the subsequent figures (e.g., for purposes of simplicity and ease of understanding).

FIG. 1 is a block diagram illustrating the clustered network environment 100 that may implement at least some embodiments of the techniques and/or systems described herein. The clustered network environment 100 comprises data storage systems 102 and 104 that are coupled over a cluster fabric 106, such as a computing network embodied as a private Infiniband, Fibre Channel (FC), or Ethernet network facilitating communication between the data storage systems 102 and 104 (and one or more modules, component, etc. therein, such as, nodes 116 and 118, for example). It will be appreciated that while two data storage systems 102 and 104 and two nodes 116 and 118 are illustrated in FIG. 1, that any suitable number of such components is contemplated. In an example, nodes 116, 118 comprise storage controllers (e.g., node 116 may comprise a primary or local storage controller and node 118 may comprise a secondary or remote storage controller) that provide client devices, such as host devices 108, 110, with access to data stored within data storage devices 128, 130. Similarly, unless specifically provided otherwise herein, the same is true for other modules, elements, features, items, etc. referenced herein and/or illustrated in the accompanying drawings. That is, a particular number of components, modules, elements, features, items, etc. disclosed herein is not meant to be interpreted in a limiting manner.

It will be further appreciated that clustered networks are not limited to any particular geographic areas and can be clustered locally and/or remotely. Thus, In an embodiment a clustered network can be distributed over a plurality of storage systems and/or nodes located in a plurality of geographic locations; while In an embodiment a clustered network can include data storage systems (e.g., 102, 104) residing in a same geographic location (e.g., in a single onsite rack of data storage devices).

In the illustrated example, one or more host devices 108, 110 which may comprise, for example, client devices, personal computers (PCs), computing devices used for storage (e.g., storage servers), and other computers or peripheral devices (e.g., printers), are coupled to the respective data storage systems 102, 104 by storage network connections 112, 114. Network connection may comprise a local area network (LAN) or wide area network (WAN), for example, that utilizes Network Attached Storage (NAS) protocols, such as a Common Internet File System (CIFS) protocol or a Network File System (NFS) protocol to exchange data packets, a Storage Area Network (SAN) protocol, such as Small Computer System Interface (SCSI) or Fiber Channel Protocol (FCP), an object protocol, such as S3, etc. Illustratively, the host devices 108, 110 may be general-purpose computers running applications, and may interact with the data storage systems 102, 104 using a client/server model for exchange of information. That is, the host device may request data from the data storage system (e.g., data on a storage device managed by a network storage control configured to process I/O commands issued by the host device for the storage device), and the data storage system may return results of the request to the host device via one or more storage network connections 112, 114.

The nodes 116, 118 on clustered data storage systems 102, 104 can comprise network or host nodes that are interconnected as a cluster to provide data storage and management services, such as to an enterprise having remote locations, cloud storage (e.g., a storage endpoint may be stored within a data cloud), etc., for example. Such a node in the clustered network environment 100 can be a device attached to the network as a connection point, redistribution point or communication endpoint, for example. A node may be capable of sending, receiving, and/or forwarding information over a network communications channel, and could comprise any device that meets any or all of these criteria. One example of a node may be a data storage and management server attached to a network, where the server can comprise a general purpose computer or a computing device particularly configured to operate as a server in a data storage and management system.

In an example, a first cluster of nodes such as the nodes 116, 118 (e.g., a first set of storage controllers configured to provide access to a first storage aggregate comprising a first logical grouping of one or more storage devices) may be located on a first storage site. A second cluster of nodes, not illustrated, may be located at a second storage site (e.g., a second set of storage controllers configured to provide access to a second storage aggregate comprising a second logical grouping of one or more storage devices). The first cluster of nodes and the second cluster of nodes may be configured according to a disaster recovery configuration where a surviving cluster of nodes provides switchover access to storage devices of a disaster cluster of nodes in the event a disaster occurs at a disaster storage site comprising the disaster cluster of nodes (e.g., the first cluster of nodes provides client devices with switchover data access to storage devices of the second storage aggregate in the event a disaster occurs at the second storage site).

As illustrated in the clustered network environment 100, nodes 116, 118 can comprise various functional components that coordinate to provide distributed storage architecture for the cluster. For example, the nodes can comprise network modules 120, 122 and disk modules 124, 126. Network modules 120, 122 can be configured to allow the nodes 116, 118 (e.g., network storage controllers) to connect with host devices 108, 110 over the storage network connections 112, 114, for example, allowing the host devices 108, 110 to access data stored in the distributed storage system. Further, the network modules 120, 122 can provide connections with one or more other components through the cluster fabric 106. For example, in FIG. 1, the network module 120 of node 116 can access a second data storage device by sending a request through the disk module 126 of node 118.

Disk modules 124, 126 can be configured to connect one or more data storage devices 128, 130, such as disks or arrays of disks, flash memory, or some other form of data storage, to the nodes 116, 118. The nodes 116, 118 can be interconnected by the cluster fabric 106, for example, allowing respective nodes in the cluster to access data on data storage devices 128, 130 connected to different nodes in the cluster. Often, disk modules 124, 126 communicate with the data storage devices 128, 130 according to the SAN protocol, such as SCSI or FCP, for example. Thus, as seen from an operating system on nodes 116, 118, the data storage devices 128, 130 can appear as locally attached to the operating system. In this manner, different nodes 116, 118, etc. may access data blocks through the operating system, rather than expressly requesting abstract files.

It should be appreciated that, while the clustered network environment 100 illustrates an equal number of network and disk modules, other embodiments may comprise a differing number of these modules. For example, there may be a plurality of network and disk modules interconnected in a cluster that does not have a one-to-one correspondence between the network and disk modules. That is, different nodes can have a different number of network and disk modules, and the same node can have a different number of network modules than disk modules.

Further, a host device 108, 110 can be networked with the nodes 116, 118 in the cluster, over the storage networking connections 112, 114. As an example, respective host devices 108, 110 that are networked to a cluster may request services (e.g., exchanging of information in the form of data packets) of nodes 116, 118 in the cluster, and the nodes 116, 118 can return results of the requested services to the host devices 108, 110. In an embodiment, the host devices 108, 110 can exchange information with the network modules 120, 122 residing in the nodes 116, 118 (e.g., network hosts) in the data storage systems 102, 104.

In an embodiment, the data storage devices 128, 130 comprise volumes 132, which is an implementation of storage of information onto disk drives or disk arrays or other storage (e.g., flash) as a file-system for data, for example. In an example, a disk array can include all traditional hard drives, all flash drives, or a combination of traditional hard drives and flash drives. Volumes can span a portion of a disk, a collection of disks, or portions of disks, for example, and typically define an overall logical arrangement of file storage on disk space in the storage system. In an embodiment a volume can comprise stored data as one or more files that reside in a hierarchical directory structure within the volume.

Volumes are typically configured in formats that may be associated with particular storage systems, and respective volume formats typically comprise features that provide functionality to the volumes, such as providing an ability for volumes to form clusters. For example, where a first storage system may utilize a first format for their volumes, a second storage system may utilize a second format for their volumes.

In the clustered network environment 100, the host devices 108, 110 can utilize the data storage systems 102, 104 to store and retrieve data from the volumes 132. In this embodiment, for example, the host device 108 can send data packets to the network module 120 in the node 116 within data storage system 102. The node 116 can forward the data to the data storage device 128 using the disk module 124, where the data storage device 128 comprises volume 132A. In this way, in this example, the host device can access the volume 132A, to store and/or retrieve data, using the data storage system 102 connected by the storage network connection 112. Further, in this embodiment, the host device 110 can exchange data with the network module 122 in the node 118 within the data storage system 104 (e.g., which may be remote from the data storage system 102). The node 118 can forward the data to the data storage device 130 using the disk module 126, thereby accessing volume 1328 associated with the data storage device 130.

It may be appreciated that performing a non-disruptive transition to a synchronous replication state may be implemented within the clustered network environment 100. It may be appreciated that performing a non-disruptive transition to a synchronous replication state may be implemented for and/or between any type of computing environment, and may be transferrable between physical devices (e.g., node 116, node 118, a desktop computer, a tablet, a laptop, a wearable device, a mobile device, a storage device, a server, etc.) and/or a cloud computing environment (e.g., remote to the clustered network environment 100).

FIG. 2 is an illustrative example of a data storage system 200 (e.g., 102, 104 in FIG. 1), providing further detail of an embodiment of components that may implement one or more of the techniques and/or systems described herein. The data storage system 200 comprises a node 202 (e.g., nodes 116, 118 in FIG. 1), and a data storage device 234 (e.g., data storage devices 128, 130 in FIG. 1). The node 202 may be a general purpose computer, for example, or some other computing device particularly configured to operate as a storage server. A host device 205 (e.g., 108, 110 in FIG. 1) can be connected to the node 202 over a network 216, for example, to provide access to files and/or other data stored on the data storage device 234. In an example, the node 202 comprises a storage controller that provides client devices, such as the host device 205, with access to data stored within data storage device 234.

The data storage device 234 can comprise mass storage devices, such as disks 224, 226, 228 of a disk array 218, 220, 222. It will be appreciated that the techniques and systems, described herein, are not limited by the example embodiment. For example, disks 224, 226, 228 may comprise any type of mass storage devices, including but not limited to magnetic disk drives, flash memory, and any other similar media adapted to store information, including, for example, data (D) and/or parity (P) information.

The node 202 comprises one or more processors 204, a memory 206, a network adapter 210, a cluster access adapter 212, and a storage adapter 214 interconnected by a system bus 242. The data storage system 200 also includes an operating system 208 installed in the memory 206 of the node 202 that can, for example, implement a Redundant Array of Independent (or Inexpensive) Disks (RAID) optimization technique to optimize a reconstruction process of data of a failed disk in an array.

The operating system 208 can also manage communications for the data storage system, and communications between other data storage systems that may be in a clustered network, such as attached to a cluster fabric 215 (e.g., 106 in FIG. 1). Thus, the node 202, such as a network storage controller, can respond to host device requests to manage data on the data storage device 234 (e.g., or additional clustered devices) in accordance with these host device requests. The operating system 208 can often establish one or more file systems on the data storage system 200, where a file system can include software code and data structures that implement a persistent hierarchical namespace of files and directories, for example. As an example, when a new data storage device (not shown) is added to a clustered network system, the operating system 208 is informed where, in an existing directory tree, new files associated with the new data storage device are to be stored. This is often referred to as “mounting” a file system.

In the example data storage system 200, memory 206 can include storage locations that are addressable by the processors 204 and adapters 210, 212, 214 for storing related software application code and data structures. The processors 204 and adapters 210, 212, 214 may, for example, include processing elements and/or logic circuitry configured to execute the software code and manipulate the data structures. The operating system 208, portions of which are typically resident in the memory 206 and executed by the processing elements, functionally organizes the storage system by, among other things, invoking storage operations in support of a file service implemented by the storage system. It will be apparent to those skilled in the art that other processing and memory mechanisms, including various computer readable media, may be used for storing and/or executing application instructions pertaining to the techniques described herein. For example, the operating system can also utilize one or more control files (not shown) to aid in the provisioning of virtual machines.

The network adapter 210 includes the mechanical, electrical and signaling circuitry needed to connect the data storage system 200 to a host device 205 over a network 216, which may comprise, among other things, a point-to-point connection or a shared medium, such as a local area network. The host device 205 (e.g., 108, 110 of FIG. 1) may be a general-purpose computer configured to execute applications. As described above, the host device 205 may interact with the data storage system 200 in accordance with a client/host model of information delivery.

The storage adapter 214 cooperates with the operating system 208 executing on the node 202 to access information requested by the host device 205 (e.g., access data on a storage device managed by a network storage controller). The information may be stored on any type of attached array of writeable media such as magnetic disk drives, flash memory, and/or any other similar media adapted to store information. In the example data storage system 200, the information can be stored in data blocks on the disks 224, 226, 228. The storage adapter 214 can include input/output (I/O) interface circuitry that couples to the disks over an I/O interconnect arrangement, such as a storage area network (SAN) protocol (e.g., Small Computer System Interface (SCSI), iSCSI, hyperSCSI, Fiber Channel Protocol (FCP)). The information is retrieved by the storage adapter 214 and, if necessary, processed by the one or more processors 204 (or the storage adapter 214 itself) prior to being forwarded over the system bus 242 to the network adapter 210 (and/or the cluster access adapter 212 if sending to another node in the cluster) where the information is formatted into a data packet and returned to the host device 205 over the network 216 (and/or returned to another node attached to the cluster over the cluster fabric 215).

In an embodiment, storage of information on disk arrays 218, 220, 222 can be implemented as one or more storage volumes 230, 232 that are comprised of a cluster of disks 224, 226, 228 defining an overall logical arrangement of disk space. The disks 224, 226, 228 that comprise one or more volumes are typically organized as one or more groups of RAIDs. As an example, volume 230 comprises an aggregate of disk arrays 218 and 220, which comprise the cluster of disks 224 and 226.

In an embodiment, to facilitate access to disks 224, 226, 228, the operating system 208 may implement a file system (e.g., write anywhere file system) that logically organizes the information as a hierarchical structure of directories and files on the disks. In this embodiment, respective files may be implemented as a set of disk blocks configured to store information, whereas directories may be implemented as specially formatted files in which information about other files and directories are stored.

Whatever the underlying physical configuration within this data storage system 200, data can be stored as files within physical and/or virtual volumes, which can be associated with respective volume identifiers, such as file system identifiers (FSIDs), which can be 32-bits in length in one example.

A physical volume corresponds to at least a portion of physical storage devices whose address, addressable space, location, etc. doesn't change, such as at least some of one or more data storage devices 234 (e.g., a Redundant Array of Independent (or Inexpensive) Disks (RAID system)). Typically the location of the physical volume doesn't change in that the (range of) address(es) used to access it generally remains constant.

A virtual volume, in contrast, is stored over an aggregate of disparate portions of different physical storage devices. The virtual volume may be a collection of different available portions of different physical storage device locations, such as some available space from each of the disks 224, 226, and/or 228. It will be appreciated that since a virtual volume is not “tied” to any one particular storage device, a virtual volume can be said to include a layer of abstraction or virtualization, which allows it to be resized and/or flexible in some regards.

Further, a virtual volume can include one or more logical unit numbers (LUNs) 238, directories 236, Qtrees 235, and files 240. Among other things, these features, but more particularly LUNS, allow the disparate memory locations within which data is stored to be identified, for example, and grouped as data storage unit. As such, the LUNs 238 may be characterized as constituting a virtual disk or drive upon which data within the virtual volume is stored within the aggregate. For example, LUNs are often referred to as virtual drives, such that they emulate a hard drive from a general purpose computer, while they actually comprise data blocks stored in various parts of a volume.

In an embodiment, one or more data storage devices 234 can have one or more physical ports, wherein each physical port can be assigned a target address (e.g., SCSI target address). To represent respective volumes stored on a data storage device, a target address on the data storage device can be used to identify one or more LUNs 238. Thus, for example, when the node 202 connects to a volume 230, 232 through the storage adapter 214, a connection between the node 202 and the one or more LUNs 238 underlying the volume is created.

In an embodiment, respective target addresses can identify multiple LUNs, such that a target address can represent multiple volumes. The I/O interface, which can be implemented as circuitry and/or software in the storage adapter 214 or as executable code residing in memory 206 and executed by the processors 204, for example, can connect to volume 230 by using one or more addresses that identify the one or more LUNs 238.

It may be appreciated that performing a non-disruptive transition to a synchronous replication state may be implemented for the data storage system 200. It may be appreciated that performing a non-disruptive transition to a synchronous replication state may be implemented for and/or between any type of computing environment, and may be transferrable between physical devices (e.g., node 202, host device 205, a desktop computer, a tablet, a laptop, a wearable device, a mobile device, a storage device, a server, etc.) and/or a cloud computing environment (e.g., remote to the node 202 and/or the host device 205).

One embodiment of performing a non-disruptive transition to a synchronous replication state is illustrated by an exemplary method 300 of FIG. 3 and further described in conjunction with system 400 of FIGS. 4A-4C. A first computing environment 404 (e.g., a node, a storage controller, a server, a storage virtual machine, or other hardware or software such as software as a service) may maintain a first storage object 406, such as a volume, a directory, a file, a LUN, a storage virtual machine comprising one or more volumes, a consistency group, or any other defined set of data, as illustrated by FIG. 4A. The first storage object 406 may have a replication relationship with a second storage object 416 maintained by a second computing environment 414. The first storage object 406 and the second storage object 416 may be in an asynchronous replication state where data is being asynchronously replicated 412 from the first storage object 406 to the second storage object 416. During asynchronous replication 412, delta data (e.g., data comprised within the first storage object 406 not yet replicated to the second storage object 416) is identified and replicated to the second storage object 416.

As provided herein, the asynchronous replication 412 may be seamlessly transitioned from the asynchronous replication 412 to synchronous replication where incoming operations are synchronously split (e.g., an incoming operation is executed upon the first storage object 406 and replicated to the seconds storage object 416 before being acknowledged as complete). The transition is seamless to client devices that read from and write data to the first storage object 406 because incoming client operations 402 are still processed during the transition. The transition is performed in a manner that maintains consistency between the first storage object 406 and the second storage object 416, and results in minimal throughput degradation of the incoming client operations 402 to the first storage object 406.

To perform the transition, one or more asynchronous incremental transfers of data from the first storage object 406 to the second storage object 416 are performed. The asynchronous incremental transfers are performed to reduce a difference in data between the first storage object 406 and the second storage object 416 by transferring delta data from the first storage object 406 to the second storage object 416.

As will be discussed in further detail, data operations and metadata operations are logged using a dirty region log 408 and a metadata log 410 during the transition, such as during a last asynchronous incremental transfer. During a final transfer, metadata operations within the metadata log 410 are first replayed and replicated to the second storage object 416 during a metadata drain phase. The metadata operations should be replicated to the second storage object 416 in the order that they were executed upon the first storage object 406, otherwise a divergence may occur where the second storage object 416 will be divergent from (different than) the first storage object 406. During the metadata drain phase, incoming operations are still being logged.

Once the metadata drain phase is complete, a data drain phase is performed to replicate dirty data, identified by the dirty region log 408, from the first storage object 406 to the second storage object 416. During the data drain phase, incoming operations are parallel split (e.g., executed upon the first storage object 406 and replicated to the second storage object 416 before being acknowledged as complete, as opposed to being logged) if a range targeted by the incoming operations is not marked as dirty within the dirty region log 408 (e.g., the incoming operations do not target a dirty region marked to be replicated during the data drain phase). Otherwise, the incoming operation is executed upon the first storage object 406 but is not replicated because the incoming operation targets a dirty region that is already marked to be replicated by the data drain phase. As dirty regions are replicated during the data drain phase, the replicated dirty regions are marked as clean in the dirty region log 408.

It is desirable to perform a clean transition from the metadata drain phase to the data drain phase, which can be difficult. For example, the metadata drain phase can complete but the data drain phase has not started, and thus incoming metadata operations are still being logged. However, since the metadata drain phase is complete, the new logged incoming metadata operations will never be drained (replicated to the second storage object 416), thus causing a divergence between the first storage object 406 and the second storage object 416. The order of metadata operations and data operations should be maintained during the transition from the metadata drain phase to the data drain phase. Once the metadata log 410 is empty, incoming data operations are parallel split if not marked as dirty within the dirty region log 408 (e.g., the incoming data operations are executed upon the first storage object 406 and replicated to the second storage object 416 before being acknowledged as complete, as opposed to being logged). But, an issue will arise if a last drained metadata operation is still inflight (e.g., has not completely been executed upon the first storage object 406 and replicated to the second storage object 416, such as where the last drained metadata operation has only so far been executed upon the first storage object 406). This last drained metadata operation that is still in flight could potentially be executed out of order with incoming data operations being parallel split, which can cause divergence between the first storage object 406 and the second storage object 416.

Accordingly, as provided herein, a seamless and clean transition is provided from the metadata drain phase to the data drain phase without causing divergence between the first storage object 406 and the second storage object 416 otherwise due to metadata operations being executed/replicated out of order.

In an embodiment, a transition from the asynchronous replication 412 to synchronous replication is triggered. Accordingly, the one or more asynchronous incremental transfers of delta data from the first storage object 406 to the second storage object 416 are performed. At 302, metadata operations, executed upon the first storage object 406, are logged into the metadata log 410. The metadata operations may be logged during a last asynchronous incremental transfer. At 304, dirty data, modified by data operations (e.g., write operations) executed upon the first storage object 406 but not yet replicated to the second storage object 416, are tracking within the dirty region log 408.

At 306, a metadata drain phase 430 is performed to replicate the logged metadata operations from the metadata log 410 to the second storage object 416, as illustrated by FIG. 4B. During the metadata drain phase 430, the incoming client operations 402 targeting the first storage object 406 are still processed so that client devices do not experience disruption or unnecessary latency. During the metadata drain phase 430, metadata operations are continued to be logged into the metadata log 410 (e.g., and executed upon the first storage object 406) and dirty data is continued to be tracked within the dirty region log 408. While, the metadata log 410 has a size greater than 1 (e.g., more than 1 metadata operation is logged within the metadata log 410 for replication during the metadata drain phase 430), metadata operations are replicated from the metadata log 410 to the second storage object 416 without using a volume barrier otherwise used to make operations mutually exclusive with respect to one another being executed upon the second storage object 416.

At 308, during the metadata drain phase 430, incoming metadata operations are logged into the metadata log 410 based upon the metadata log 410 having a non-zero size, such as where at least one metadata operation is still logged within the metadata log 410 for being replicated to the second storage object 416 during the metadata drain phase 430. When the metadata log 410 has a size of 1 and thus comprises a last metadata operation, the last metadata operation is replicated from the metadata log 410 to the second storage object 416 using the volume barrier. This is because an incoming metadata operation may be received while the last metadata operation is still being replicated (is in flight) and the metadata log 410 will have a zero size, and thus will be replicated to the second storage object 416 instead of being logged into the metadata log 410. In this way, the volume barrier ensures that the last metadata operation and the incoming metadata operation are serialized to ensure correctness and consistency of the second storage object 416 with the first storage object 406 so that the second storage object 416 does not diverge from the first storage object 406.

At 310, a metadata operation is received when the metadata log 410 has a zero size, the metadata operation is replicated to the second storage object 416 instead of being logged because the metadata drain phase 430 is complete. Replication of the metadata operation is serialized with metadata operations replicated from the metadata log 410 (e.g., any inflight metadata operations such as the last metadata operation that may not have finished being replicated) by using the volume barrier to ensure the metadata operations are mutually exclusive and serially executed upon the second storage object 416 with respect to one another.

Once the metadata drain phase 430 has completed (e.g., the metadata log 410 has a zero size), a data drain phase 440 is performed, as illustrated by FIG. 4C. During a transition state from the metadata drain phase 430 to the data drain phase 440, incoming metadata operations are replicated to the second storage object 416. During the data drain phase 440, dirty data, identified by the dirty region log 408, is replicated from the first storage object 406 to the second storage object 416. During the data drain phase 440, the incoming client operations 402 targeting the first storage object 406 are still processed so that client devices do not experience disruption or unnecessary latency. For example, incoming metadata operation are replicated to the second storage object 416 during the data drain phase. The replication of the incoming metadata may be serialized with respect to the replication of the dirty data using the volume barrier so that the second storage object 416 does not diverge from the first storage object 406.

Once the data drain phase 440 is complete, the replication relationship between the first storage object 406 and the second storage object 416 may transition to a synchronous replication state. In this way, the first storage object 406 and the second storage object 416 have been seamlessly transitioned to the synchronous replication state with minimal to no client disruption and latency, and while maintaining consistency between the second storage object 416 and the first storage object 406 without any divergence.

Still another embodiment involves a computer-readable medium 500 comprising processor-executable instructions configured to implement one or more of the techniques presented herein. An example embodiment of a computer-readable medium or a computer-readable device that is devised in these ways is illustrated in FIG. 5, wherein the implementation comprises a computer-readable medium 508, such as a compact disc-recordable (CD-R), a digital versatile disc-recordable (DVD-R), flash drive, a platter of a hard disk drive, etc., on which is encoded computer-readable data 506. This computer-readable data 506, such as binary data comprising at least one of a zero or a one, in turn comprises a processor-executable computer instructions 504 configured to operate according to one or more of the principles set forth herein. In some embodiments, the processor-executable computer instructions 504 are configured to perform a method 502, such as at least some of the exemplary method 300 of FIG. 3, for example. In some embodiments, the processor-executable computer instructions 504 are configured to implement a system, such as at least some of the exemplary system 400 of FIGS. 4A-4C, for example. Many such computer-readable media are contemplated to operate in accordance with the techniques presented herein.

FIG. 6 is a diagram illustrating an example operating environment 600 in which an embodiment of the techniques described herein may be implemented. In one example, the techniques described herein may be implemented within a client device 628, such as a laptop, tablet, personal computer, mobile device, wearable device, etc. In another example, the techniques described herein may be implemented within a storage controller 630, such as a node configured to manage the storage and access to data on behalf of the client device 628 and/or other client devices. In another example, the techniques described herein may be implemented within a distributed computing platform 602 such as a cloud computing environment (e.g., a cloud storage environment, a multi-tenant platform, etc.) configured to manage the storage and access to data on behalf of the client device 628 and/or other client devices.

In yet another example, at least some of the techniques described herein are implemented across one or more of the client device 628, the storage controller 630, and the distributed computing platform 602. For example, the client device 628 may transmit operations, such as data operations to read data and write data and metadata operations (e.g., a create file operation, a rename directory operation, a resize operation, a set attribute operation, etc.), over a network 626 to the storage controller 630 for implementation by the storage controller 630 upon storage. The storage controller 630 may store data associated with the operations within volumes or other data objects/structures hosted within locally attached storage, remote storage hosted by other computing devices accessible over the network 626, storage provided by the distributed computing platform 602, etc. The storage controller 630 may replicate the data and/or the operations to other computing devices so that one or more replicas, such as a destination storage volume that is maintained as a replica of a source storage volume, are maintained. Such replicas can be used for disaster recovery and failover.

The storage controller 630 may store the data or a portion thereof within storage hosted by the distributed computing platform 602 by transmitting the data to the distributed computing platform 602. In one example, the storage controller 630 may locally store frequently accessed data within locally attached storage. Less frequently accessed data may be transmitted to the distributed computing platform 602 for storage within a data storage tier 608. The data storage tier 608 may store data within a service data store 620, and may store client specific data within client data stores assigned to such clients such as a client (1) data store 622 used to store data of a client (1) and a client (N) data store 624 used to store data of a client (N). The data stores may be physical storage devices or may be defined as logical storage, such as a virtual volume, LUNs, or other logical organizations of data that can be defined across one or more physical storage devices. In another example, the storage controller 630 transmits and stores all client data to the distributed computing platform 602. In yet another example, the client device 628 transmits and stores the data directly to the distributed computing platform 602 without the use of the storage controller 630.

The management of storage and access to data can be performed by one or more storage virtual machines (SMVs) or other storage applications that provide software as a service (SaaS) such as storage software services. In one example, an SVM may be hosted within the client device 628, within the storage controller 630, or within the distributed computing platform 602 such as by the application server tier 606. In another example, one or more SVMs may be hosted across one or more of the client device 628, the storage controller 630, and the distributed computing platform 602.

In one example of the distributed computing platform 602, one or more SVMs may be hosted by the application server tier 606. For example, a server (1) 616 is configured to host SVMs used to execute applications such as storage applications that manage the storage of data of the client (1) within the client (1) data store 622. Thus, an SVM executing on the server (1) 616 may receive data and/or operations from the client device 628 and/or the storage controller 630 over the network 626. The SVM executes a storage application to process the operations and/or store the data within the client (1) data store 622. The SVM may transmit a response back to the client device 628 and/or the storage controller 630 over the network 626, such as a success message or an error message. In this way, the application server tier 606 may host SVMs, services, and/or other storage applications using the server (1) 616, the server (N) 618, etc.

A user interface tier 604 of the distributed computing platform 602 may provide the client device 628 and/or the storage controller 630 with access to user interfaces associated with the storage and access of data and/or other services provided by the distributed computing platform 602. In an example, a service user interface 610 may be accessible from the distributed computing platform 602 for accessing services subscribed to by clients and/or storage controllers, such as data replication services, application hosting services, data security services, human resource services, warehouse tracking services, accounting services, etc. For example, client user interfaces may be provided to corresponding clients, such as a client (1) user interface 612, a client (N) user interface 614, etc. The client (1) can access various services and resources subscribed to by the client (1) through the client (1) user interface 612, such as access to a web service, a development environment, a human resource application, a warehouse tracking application, and/or other services and resources provided by the application server tier 606, which may use data stored within the data storage tier 608.

The client device 628 and/or the storage controller 630 may subscribe to certain types and amounts of services and resources provided by the distributed computing platform 602. For example, the client device 628 may establish a subscription to have access to three virtual machines, a certain amount of storage, a certain type/amount of data redundancy, a certain type/amount of data security, certain service level agreements (SLAs) and service level objectives (SLOs), latency guarantees, bandwidth guarantees, access to execute or host certain applications, etc. Similarly, the storage controller 630 can establish a subscription to have access to certain services and resources of the distributed computing platform 602.

As shown, a variety of clients, such as the client device 628 and the storage controller 630, incorporating and/or incorporated into a variety of computing devices may communicate with the distributed computing platform 602 through one or more networks, such as the network 626. For example, a client may incorporate and/or be incorporated into a client application (e.g., software) implemented at least in part by one or more of the computing devices.

Examples of suitable computing devices include personal computers, server computers, desktop computers, nodes, storage servers, storage controllers, laptop computers, notebook computers, tablet computers or personal digital assistants (PDAs), smart phones, cell phones, and consumer electronic devices incorporating one or more computing device components, such as one or more electronic processors, microprocessors, central processing units (CPU), or controllers. Examples of suitable networks include networks utilizing wired and/or wireless communication technologies and networks operating in accordance with any suitable networking and/or communication protocol (e.g., the Internet). In use cases involving the delivery of customer support services, the computing devices noted represent the endpoint of the customer support delivery process, i.e., the consumer's device.

The distributed computing platform 602, such as a multi-tenant business data processing platform or cloud computing environment, may include multiple processing tiers, including the user interface tier 604, the application server tier 606, and a data storage tier 608. The user interface tier 604 may maintain multiple user interfaces, including graphical user interfaces and/or web-based interfaces. The user interfaces may include the service user interface 610 for a service to provide access to applications and data for a client (e.g., a “tenant”) of the service, as well as one or more user interfaces that have been specialized/customized in accordance with user specific requirements, which may be accessed via one or more APIs.

The service user interface 610 may include components enabling a tenant to administer the tenant's participation in the functions and capabilities provided by the distributed computing platform 602, such as accessing data, causing execution of specific data processing operations, etc. Each processing tier may be implemented with a set of computers, virtualized computing environments such as a storage virtual machine or storage virtual server, and/or computer components including computer servers and processors, and may perform various functions, methods, processes, or operations as determined by the execution of a software application or set of instructions.

The data storage tier 608 may include one or more data stores, which may include the service data store 620 and one or more client data stores. Each client data store may contain tenant-specific data that is used as part of providing a range of tenant-specific business and storage services or functions, including but not limited to ERP, CRM, eCommerce, Human Resources management, payroll, storage services, etc. Data stores may be implemented with any suitable data storage technology, including structured query language (SQL) based relational database management systems (RDBMS), file systems hosted by operating systems, object storage, etc.

In accordance with one embodiment of the invention, the distributed computing platform 602 may be a multi-tenant and service platform operated by an entity in order to provide multiple tenants with a set of business related applications, data storage, and functionality. These applications and functionality may include ones that a business uses to manage various aspects of its operations. For example, the applications and functionality may include providing web-based access to business information systems, thereby allowing a user with a browser and an Internet or intranet connection to view, enter, process, or modify certain types of business information or any other type of information.

In an embodiment, the described methods and/or their equivalents may be implemented with computer executable instructions. Thus, In an embodiment, a non-transitory computer readable/storage medium is configured with stored computer executable instructions of an algorithm/executable application that when executed by a machine(s) cause the machine(s) (and/or associated components) to perform the method. Example machines include but are not limited to a processor, a computer, a server operating in a cloud computing system, a server configured in a Software as a Service (SaaS) architecture, a smart phone, and so on). In an embodiment, a computing device is implemented with one or more executable algorithms that are configured to perform any of the disclosed methods.

It will be appreciated that processes, architectures and/or procedures described herein can be implemented in hardware, firmware and/or software. It will also be appreciated that the provisions set forth herein may apply to any type of special-purpose computer (e.g., file host, storage server and/or storage serving appliance) and/or general-purpose computer, including a standalone computer or portion thereof, embodied as or including a storage system. Moreover, the teachings herein can be configured to a variety of storage system architectures including, but not limited to, a network-attached storage environment and/or a storage area network and disk assembly directly attached to a client or host computer. Storage system should therefore be taken broadly to include such arrangements in addition to any subsystems configured to perform a storage function and associated with other equipment or systems.

In some embodiments, methods described and/or illustrated in this disclosure may be realized in whole or in part on computer-readable media. Computer readable media can include processor-executable instructions configured to implement one or more of the methods presented herein, and may include any mechanism for storing this data that can be thereafter read by a computer system. Examples of computer readable media include (hard) drives (e.g., accessible via network attached storage (NAS)), Storage Area Networks (SAN), volatile and non-volatile memory, such as read-only memory (ROM), random-access memory (RAM), electrically erasable programmable read-only memory (EEPROM) and/or flash memory, compact disk read only memory (CD-ROM)s, CD-Rs, compact disk re-writeable (CD-RW)s, DVDs, cassettes, magnetic tape, magnetic disk storage, optical or non-optical data storage devices and/or any other medium which can be used to store data.

Although the subject matter has been described in language specific to structural features or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing at least some of the claims.

Various operations of embodiments are provided herein. The order in which some or all of the operations are described should not be construed to imply that these operations are necessarily order dependent. Alternative ordering will be appreciated given the benefit of this description. Further, it will be understood that not all operations are necessarily present in each embodiment provided herein. Also, it will be understood that not all operations are necessary in some embodiments.

Furthermore, the claimed subject matter is implemented as a method, apparatus, or article of manufacture using standard application or engineering techniques to produce software, firmware, hardware, or any combination thereof to control a computer to implement the disclosed subject matter. The term “article of manufacture” as used herein is intended to encompass a computer application accessible from any computer-readable device, carrier, or media. Of course, many modifications may be made to this configuration without departing from the scope or spirit of the claimed subject matter.

As used in this application, the terms “component”, “module,” “system”, “interface”, and the like are generally intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution. For example, a component includes a process running on a processor, a processor, an object, an executable, a thread of execution, an application, or a computer. By way of illustration, both an application running on a controller and the controller can be a component. One or more components residing within a process or thread of execution and a component may be localized on one computer or distributed between two or more computers.

Moreover, “exemplary” is used herein to mean serving as an example, instance, illustration, etc., and not necessarily as advantageous. As used in this application, “or” is intended to mean an inclusive “or” rather than an exclusive “or”. In addition, “a” and “an” as used in this application are generally be construed to mean “one or more” unless specified otherwise or clear from context to be directed to a singular form. Also, at least one of A and B and/or the like generally means A or B and/or both A and B. Furthermore, to the extent that “includes”, “having”, “has”, “with”, or variants thereof are used, such terms are intended to be inclusive in a manner similar to the term “comprising”.

Many modifications may be made to the instant disclosure without departing from the scope or spirit of the claimed subject matter. Unless specified otherwise, “first,” “second,” or the like are not intended to imply a temporal aspect, a spatial aspect, an ordering, etc. Rather, such terms are merely used as identifiers, names, etc. for features, elements, items, etc. For example, a first set of information and a second set of information generally correspond to set of information A and set of information B or two different or two identical sets of information or the same set of information.

Also, although the disclosure has been shown and described with respect to one or more implementations, equivalent alterations and modifications will occur to others skilled in the art based upon a reading and understanding of this specification and the annexed drawings. The disclosure includes all such modifications and alterations and is limited only by the scope of the following claims. In particular regard to the various functions performed by the above described components (e.g., elements, resources, etc.), the terms used to describe such components are intended to correspond, unless otherwise indicated, to any component which performs the specified function of the described component (e.g., that is functionally equivalent), even though not structurally equivalent to the disclosed structure. In addition, while a particular feature of the disclosure may have been disclosed with respect to only one of several implementations, such feature may be combined with one or more other features of the other implementations as may be desired and advantageous for any given or particular application. 

What is claimed is:
 1. A method comprising: logging metadata operations, executed upon a first storage object, into a metadata log; tracking dirty data, modified by data operations executed upon the first storage object, into a dirty region log; replicating the metadata operations from the metadata log to a second storage object during a metadata drain phase; logging a first incoming metadata operation during the metadata drain phase into the metadata log based upon the metadata log having a non-zero size; and replicating a second incoming metadata operation to the second storage object based upon the metadata log having a zero size.
 2. The method of claim 1, comprising: replicating incoming metadata operations to the second storage object based upon a state indicating a transition from the metadata drain phase to a data drain phase where the dirty data is replicated to the second storage object.
 3. The method of claim 1, comprising: replicating the dirty data from the first storage object, as indicated by the dirty region log, to the second storage object during a data drain phase based upon completion of the metadata drain phase.
 4. The method of claim 3, comprising: replicating incoming metadata operations to the second storage object during the data drain phase.
 5. The method of claim 4, comprising: serializing replication of the dirty data and the incoming metadata operations using a volume barrier.
 6. The method of claim 3, comprising: transitioning the first storage object and the second storage object from an asynchronous replication relationship to a synchronous replication relationship based upon the metadata drain phase and the data drain phase completing.
 7. The method of claim 1, wherein the replicating a second incoming metadata operation comprises: serializing replication of the second incoming metadata operation with metadata operations replicated from the metadata log using a volume barrier.
 8. The method of claim 7, wherein the volume barrier is used to make the second incoming metadata operation and the metadata operations mutually exclusive for acquiring the volume barrier.
 9. A non-transitory machine readable medium comprising instructions for performing a method, which when executed by a machine, causes the machine to: log metadata operations, executed upon a first storage object, into a metadata log; track dirty data, modified by data operations executed upon the first storage object, into a dirty region log; replicate the metadata operations from the metadata log to a second storage object during a metadata drain phase; log a first incoming metadata operation during the metadata drain phase into the metadata log based upon the metadata log having a non-zero size; and replicate a second incoming metadata operation to the second storage object based upon the metadata log having a zero size.
 10. The non-transitory machine readable medium of claim 9, wherein the instructions cause the machine to: log metadata operations into the metadata log and tracking dirty data within the dirty region log during the metadata drain phase, wherein metadata operations are replicated from the metadata log without using a volume barrier based upon the metadata log having a size greater than
 1. 11. The non-transitory machine readable medium of claim 9, wherein the instructions cause the machine to: replicate a last metadata operation from the metadata log to the second storage object using a volume barrier based upon the metadata log having a size of
 1. 12. The non-transitory machine readable medium of claim 11, wherein the instructions cause the machine to: serializing replication of the last metadata operation with an incoming metadata operation using the volume barrier.
 13. The non-transitory machine readable medium of claim 9, wherein the instructions cause the machine to: replicate the dirty data from the dirty region log to the second storage object during a data drain phase based upon completion of the metadata drain phase.
 14. The non-transitory machine readable medium of claim 13, wherein the data drain phase is triggered based upon the metadata log having the zero size.
 15. A computing device comprising: a memory comprising machine executable code for performing a method; and a processor coupled to the memory, the processor configured to execute the machine executable code to cause the processor to: log metadata operations, executed upon a first storage object, into a metadata log; track dirty data, modified by data operations executed upon the first storage object, into a dirty region log; replicate the metadata operations from the metadata log to a second storage object during a metadata drain phase; log a first incoming metadata operation during the metadata drain phase into the metadata log based upon the metadata log having a non-zero size; and replicate a second incoming metadata operation to the second storage object based upon the metadata log having a zero size.
 16. The computing device of claim 15, wherein the machine executable code causes the processor to: perform asynchronous incremental transfers of data of the first storage object from a first computing environment to the second storage object at a second computing environment.
 17. The computing device of claim 16, wherein the machine executable code causes the processor to: log the metadata operations and track the dirty data during a last asynchronous incremental transfer.
 18. The computing device of claim 15, wherein the machine executable code causes the processor to: replicate the dirty data from the dirty region log to the second storage object during a data drain phase based upon completion of the metadata drain phase.
 19. The computing device of claim 18, wherein the machine executable code causes the processor to: transition to a synchronous replication state where incoming operations targeting the first storage object are synchronously replicated to the second storage object based upon the data drain phase completing.
 20. The computing device of claim 18, wherein the machine executable code causes the processor to: processing incoming operations targeting the first storage object during the metadata drain phase and the data drain phase. 